Instruction Sequence Based Non-uniform Complexity Classes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Instruction sequence based non-uniform complexity classes

We present an approach to non-uniform complexity in which singlepass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes. One kind includes a counterpart of the well-known non-uniform complexity class P/poly and another kind includes a counterpart of the well-known non-uniform complexity ...

متن کامل

Instruction sequences and non-uniform complexity theory

We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and NP/poly and formulate a counterpart of the complexity theoretic conjecture that NP 6⊆ P/poly. In addition, we define a notion of completeness for the counterpart o...

متن کامل

Non-uniform Instruction Scheduling

Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant losses in performance. However, these performance losses are incurred only due to a small fraction of instructions, which are intolerant to the non-atomic scheduling. We first perform an empirical analysis of the inst...

متن کامل

Some Connections Between Bounded Query Classes and Non-Uniform Complexity

Consider the function F A k (x 1 ; : : :; x k) = A(x 1) A(x k). We show that if F A k can be computed with less than k queries to some set X then A 2 P=poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming p 3 6 = p 3 the hierarchy of functions computed with a bounded number of queries to...

متن کامل

NUSBL: Non-Uniform Sequence Based Localization

For the localization competition, we propose to deploy an indoor localization system based on Non-Uniform Sequence Based Localization (NU-SBL) algorithm. NU-SBL algorithm works by dividing the two dimensional localization space into faces on the basis of the ranked RSS from the deployed stationary beacon nodes. The algorithm requires the scaled floor plan of the building and the location coordi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Annals of Computer Science

سال: 2014

ISSN: 2248-2695

DOI: 10.7561/sacs.2014.1.47